Interval systems over idempotent semiring

Bisimulations for weighted automata over an additively idempotent semiring

We show that the methodology for testing the existence and computation the greatest simulations and bisimulations, developed in the framework of fuzzy automata [M. Ćirić et al., Fuzzy Sets and Systems 186 (2012) 100–139, 208 (2012) 22–42], can be applied in a similar form to weighted automata over an additively idempotent semiring. We define two types of simulations and four types of bisimulati...

Idempotent Interval Analysis and Optimization Problems

Many problems in optimization theory are strongly nonlinear in the traditional sense but possess a hidden linear structure over suitable idempotent semirings. After an overview of ‘Idempotent Mathematics’ with an emphasis on matrix theory, interval analysis over idempotent semirings is developed. The theory is applied to construction of exact interval solutions to the interval discrete stationa...

On idempotent matrices over semirings

Idempotent matrices play a significant role while dealing with different questions in matrix theory and its applications. It is easy to see that over a field any idempotent matrix is similar to a diagonal matrix with 0 and 1 on the main diagonal. Over a semiring the situation is quite different. For example, the matrix J of all ones is idempotent over Boolean semiring. The first characterizatio...

Inversion of Matrices over a Commutative Semiring

It is a well-known consequence of the elementary theory of vector spaces that if A and B are n-by-n matrices over a field (or even a skew field) such that AB = 1, then BA = 1. This result remains true for matrices over a commutative ring, however, it is not, in general, true for matrices over noncommutatives rings. In this paper we show that if A and B are n-by-n matrices over a commutative sem...

Retracted: Idempotent Elements of the Endomorphism Semiring of a Finite Chain